/*
pku3207
注：1和2配对，3和4配对，从1开始； 
*/
#include <iostream>
#include <algorithm>
#include <cstdlib>
#include <cstdio>
#include <stack>
#include <cstring>
using namespace std;
const int maxm=500005, maxn=1005;
struct A{//表示邻接表的变量
    int nxt, v;
}edg[maxm];
int head[maxn], E;
//用来求连通分量的变量:连通集cnt从1开始；
int dfn[maxn], low[maxn], visitNum, cnt, stop;
bool instack[maxn];
int belong[maxn], stap[maxn];
int N;

struct B{
    int a, b;
}g[505];

inline void addedg(int u, int v){
    edg[E].v = v; edg[E].nxt = head[u];
    head[u] = E++;
}
void tarjan(int i)
{
    int j, t;
    dfn[i] = low[i] = ++visitNum;
    instack[i] = 1;
    stap[++stop]=i;
    for (t=head[i]; t!=-1; t=edg[t].nxt){
        j = edg[t].v;
        if (!dfn[j]){
            tarjan(j);
            if (low[j]<low[i]) low[i] = low[j];
        }
        else if (instack[j] && dfn[j]<low[i])
            low[i] = dfn[j];
    }
    if (dfn[i]==low[i]){
        cnt++;
        while (1){
            j = stap[stop--];
            instack[j] = 0;
            belong[j] = cnt;
            if (j==i) break;
        }
    }
}
bool getscc()
{
    memset (dfn, 0, sizeof(dfn));
    memset (instack, 0, sizeof(instack));
    stop=cnt=visitNum=0;
    for (int i=1; i<=N; i++){
        if (!dfn[i])
           tarjan(i);
    }
    for (int i=1; i<=N; i+=2){//!
        if (belong[i] == belong[i+1]) return false;
    }
    return true;
}

int main()
{
    //freopen ("in.txt", "r", stdin);
    int n, m, i, j;
    while (scanf ("%d%d", &n, &m)!=EOF){
        memset (head, -1, sizeof(head)); E=0;
        N = m<<1;
        for (i=1; i<=m; i++){
            scanf ("%d%d", &g[i].a, &g[i].b);
            if (g[i].a>g[i].b) swap(g[i].a, g[i].b);
        }
        for (i=1; i<=m; i++){
            for (j=i+1; j<=m; j++){
                if (g[i].a<g[j].a&&g[j].a<g[i].b&&g[i].b<g[j].b || g[j].a<g[i].a&&g[i].a<g[j].b&&g[j].b<g[i].b){
                //if ((g[i].a-g[j].a)*(g[i].b-g[j].b)>0){
                    addedg(2*i-1, 2*j); addedg(2*j-1, 2*i);
                    addedg(2*j, 2*i-1); addedg(2*i, 2*j-1);
                }
            }
        }
        if (!getscc()) printf ("the evil panda is lying again\n");
        else printf ("panda is telling the truth...\n");
    }
    return 0;
}
